GPU-based Line Probing Techniques for Mikami Routing Algorithm
نویسندگان
چکیده
Graphic processing unit (GPU), which contains hundreds of processing cores, is becoming a popular device for high performance computation in multi-core era. With strictly computation regularity characteristic, specific algorithms are key challenges for performance speed-up. In this paper, we propose a parallel CUDA-Mikami routing algorithm on NVIDIA’s GPU. A 32-bit routing grid encoding is proposed to simplify wire intersection identification and wire direction recognition. Furthermore, thread-level and warp-level line probing techniques are proposed for vertical and horizontal routings, respectively. The experimental results indicate that the run-time efficiency is promising as compared to traditional CPU-
منابع مشابه
Enhanced Ticket - Based Qos Routing Algorithms
Quality of Service (QoS) routing in computer networks is an important component in QoS architectures in order to provide end-to-end QoS support. Two major issues make QoS routing difficult: (1) Most of the QoS routing problems are NP-hard, such as the Delay Constraint Least Cost Routing (DCLCR) problem; (2) Imprecise network information degrades the routing performance. Using DCLCR problem as a...
متن کاملImplementation of the direction of arrival estimation algorithms by means of GPU-parallel processing in the Kuda environment (Research Article)
Direction-of-arrival (DOA) estimation of audio signals is critical in different areas, including electronic war, sonar, etc. The beamforming methods like Minimum Variance Distortionless Response (MVDR), Delay-and-Sum (DAS), and subspace-based Multiple Signal Classification (MUSIC) are the most known DOA estimation techniques. The mentioned methods have high computational complexity. Hence using...
متن کاملAnt Colony Algorithm for the Single Loop Routing Problem
In this paper, a new algorithm for solving the single loop routing problem is presented. The purpose of the single loop routing problem(SLRP) is to find the shortest loop for an automated guided vehicle covering at least one edge of each department of a block layout. First it shown that this problem can be represented as a graph model. Then a meta-heuristic algorithm based on and colony system ...
متن کاملThe enhanced ticket-based routing algorithm
The Delay-constrained least-cost routing problem is to find the least cost path which satisfies a given delay constraint. There are two major difficulties to solve this problem. The first difficulty is the NP-Completeness of this routing problem. The second difficulty is that the networking information used for routing may be imprecise. The ticket-based routing (TBR) algorithm[1], aiming to fin...
متن کاملAnt Colony Algorithm for the Single Loop Routing Problem
In this paper, a new algorithm for solving the single loop routing problem is presented. The purpose of the single loop routing problem(SLRP) is to find the shortest loop for an automated guided vehicle covering at least one edge of each department of a block layout. First it shown that this problem can be represented as a graph model. Then a meta-heuristic algorithm based on and colony system ...
متن کامل